Se p 20 05 DYNAMICAL COMPLEXITY OF DISCRETE TIME REGULATORY NETWORKS
نویسنده
چکیده
The functioning and development of living organisms – from bacteria to humans – are controlled by genetic regulatory networks composed of interactions between DNA, RNA, proteins, and small molecules. The size and complexity of these networks make an intuitive understanding of their dynamics difficult to attain. In order to predict the behavior of regulatory systems in a systematic way, we need modeling and simulation tools with a solid foundation in mathematics and computer science.
منابع مشابه
FINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کامل5 Dynamical Complexity of Discrete Time Regulatory Networks
The functioning and development of living organisms – from bacteria to humans – are controlled by genetic regulatory networks composed of interactions between DNA, RNA, proteins, and small molecules. The size and complexity of these networks make an intuitive understanding of their dynamics difficult to attain. In order to predict the behavior of regulatory systems in a systematic way, we need ...
متن کاملSynchronization analysis of complex dynamical networks with hybrid coupling with application to Chua’s circuit
Complex dynamic networks have been considered by researchers for their applications in modeling and analyzing many engineering issues. These networks are composed of interconnected nodes and exhibit complex behaviors that are resulted from interactions between these nodes. Synchronization, which is the concept of coordinated behavior between nodes, is the most interested behavior in these netwo...
متن کاملComplexity of the BN and the PBN Models of GRNs and Mappings for Complexity Reduction
One can think of a Gene Regulatory Network (GRN) as a network of relations among strands of DNA (genes) and the regulatory activities associated with those genes (Dougherty and Braga-Neto, 2006). This general definition allows for many mathematical (usually dynamical) systems to be called GRNs. The goodness of each such model is evaluated using several important criteria: the level of descripti...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005